Partial transformation monoids preserving a uniform partition
نویسندگان
چکیده
منابع مشابه
Uniform Generation in Trace Monoids
We consider the problem of random uniform generation of traces (the elements of a free partially commutative monoid) in light of the uniform measure on the boundary at infinity of the associated monoid. We obtain a product decomposition of the uniform measure at infinity if the trace monoid has several irreducible components—a case where other notions such as Parry measures, are not defined. Ra...
متن کاملComplexity Analysis: Finite Transformation Monoids
We examine the computational complexity of some problems from algebraic automata theory and from the field of communication complexity: testing Green’s relations (relations that are fundamental in monoid theory), checking the property of a finite monoid to have only Abelian subgroups, and determining the deterministic communication complexity of a regular language. By well-known algebraizations...
متن کاملUpper set monoids and length preserving morphisms
Length preserving morphisms and inverse of substitutions are two wellstudied operations on regular languages. Their connection with varieties generated by power monoids was established independently by Reutenauer and Straubing in 1979. More recently, an ordered version of this theory was proposed by Polák and by the authors. In this paper, we present an improved version of these results and obt...
متن کاملPartial monoids: associativity and confluence
A partial monoid P is a set with a partial multiplication × (and total identity 1P ) which satisfies some associativity axiom. The partial monoid P may be embedded in the free monoid P ∗ and the product × is simulated by a string rewriting system on P ∗ that consists in evaluating the concatenation of two letters as a product in P , when it is defined, and a letter 1P as the empty word ǫ. In th...
متن کاملCongruence Preserving Functions on Free Monoids
A function on an algebra is congruence preserving if, for any congruence, it maps congruent elements to congruent elements. We show that, on a free monoid generated by at least three letters, a function from the free monoid into itself is congruence preserving if and only if it is of the form x 7→ w0xw1 · · ·wn−1xwn for some finite sequence of words w0, . . . , wn. We generalize this result to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Semigroup Forum
سال: 2014
ISSN: 0037-1912,1432-2137
DOI: 10.1007/s00233-014-9629-5